Degree Tables for Secure Distributed Matrix Multiplication
نویسندگان
چکیده
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute product two matrices with assistance honest but curious servers. construct polynomial codes for SDMM by studying recently introduced combinatorial tool called degree table. For fixed partitioning, minimizing total communication cost code is equivalent $N$ , number distinct elements corresponding propose new constructions tables low elements. These lead general family SDMM, we call notation="LaTeX">$\mathsf {GASP}_{r}$ (Gap Additive Secure Polynomial codes) parameterized an integer notation="LaTeX">$r$ . outperforms all previously known under outer partitioning. also present lower bounds on and prove optimality or asymptotic our certain regimes. Moreover, formulate construction optimal as linear program use it system parameters that were able test.
منابع مشابه
Communication lower bounds for distributed-memory matrix multiplication
We present lower bounds on the amount of communication that matrixmultiplication algorithms must perform on a distributed-memory parallel computer. We denote the number of processors by P and the dimension of square matrices by n. We show that the most widely-used class of algorithms, the so-called 2-dimensional (2D) algorithms, are optimal, in the sense that in any algorithm that uses only O(n...
متن کاملEfficient Secure Matrix Multiplication over Lwe-based Homomorphic Encryption
Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertext...
متن کاملSecure Construction of Contingency Tables from Distributed Data
Contingency tables are widely used in many fields to analyze the relationship or infer the association between two or more variables. Indeed, due to their simplicity and ease, they are one of the first methods used to analyze gathered data. Typically, the construction of contingency tables from source data is considered straightforward since all data is supposed to be aggregated at a single par...
متن کاملClosest Multiplication Tables of Groups
Suppose that all groups of order n are defined on the same set G of cardinality n, and let the distance of two groups of order n be the number of pairs (a, b) ∈ G×G where the two group operations differ. Given a group G(◦) of order n, we find all groups of order n, up to isomorphism, that are closest to G(◦).
متن کاملAlgorithms for Matrix Multiplication
Strassen’s and Winograd’s algorithms for n × n matrix multiplication are investigated and compared with the normal algorithm. The normal algorithm requires n3 + O(n2) multiplications and about the same number of additions. Winograd’s algorithm almost halves the number of multiplications at the expense of more additions. Strassen’s algorithm reduces the total number of operations to O(n2.82) by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE journal on selected areas in information theory
سال: 2021
ISSN: ['2641-8770']
DOI: https://doi.org/10.1109/jsait.2021.3102882